University of Toronto Department of Mathematics - PDFSEARCH.IO - Document Search Engine

University of Toronto Department of Mathematics
Results: 146

#	Item
121	Unbounded operators and the Friedrichs extension Jordan Bell Department of Mathematics, University of Toronto May 26, 2014 Add to Reading List Source URL: individual.utoronto.ca Language: English - Date: 2014-05-26 13:32:31 Theoretical physics Unbounded operator Friedrichs extension Hilbert space Decomposition of spectrum Compact operator on Hilbert space Operator theory Mathematical analysis Functional analysis
122	Effective Preprocessing with Hyper-Resolution and Equality Reduction Fahiem Bacchus1 and Jonathan Winter1 Department of Computer Science, University Of Toronto,? Toronto, Ontario, Canada [fbacchus\|winter]@cs.toronto.edu Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2003-06-07 02:16:30 Mathematical logic Logic programming Rules of inference Logic in computer science Complexity classes Unit propagation Resolution Clause NL Theoretical computer science Mathematics Automated theorem proving
123	Solving Non-clausal Formulas with DPLL search Christian Thiffault1 , Fahiem Bacchus1 , and Toby Walsh 2 1 Department of Computer Science, University of Toronto, Toronto, Ontario, Canada Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2004-07-03 23:15:04 Applied mathematics Resolution True quantified Boolean formula Propositional variable Unit propagation Satz DPLL algorithm Boolean satisfiability problem Theoretical computer science Automated theorem proving Mathematics
124	Value-directed Compression of Large-scale Assignment Problems Tyler Lu and Craig Boutilier Department of Computer Science University of Toronto {tl,cebly}@cs.toronto.edu Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-11-27 10:09:39 Convex optimization Operations research Combinatorial optimization Duality Assignment problem Markov decision process Linear programming relaxation Mathematical optimization Linear programming Mathematics
125	Efficient Vote Elicitation under Candidate Uncertainty Joel Oren and Yuval Filmus and Craig Boutilier Department of Computer Science, University of Toronto {oren,yuvalf,cebly}@cs.toronto.edu Abstract Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-04-27 18:08:26 Voting Social choice theory Voting system criteria Normal distribution Partition Mathematics Single winner electoral systems Borda count
126	Elicitation and Approximately Stable Matching with Partial Preferences Joanna Drummond and Craig Boutilier Department of Computer Science University of Toronto {jdrummond,cebly}@cs.toronto.edu Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-04-27 17:48:15 Applied mathematics Cooperative games Stable marriage problem Microeconomics Preference elicitation Minimax Preference Mathematics Game theory Matching
127	Assessing Regret-based Preference Elicitation with the UTP REF Recommendation System Darius Braziunas Department of Computer Science University of Toronto, Canada Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2010-03-28 13:51:13 Mathematics Information science Utility Marketing Minimax Regret Expected utility hypothesis Preference elicitation Elicitation Decision theory Game theory Statistics
128	Probabilistic Matrix Factorization Ruslan Salakhutdinov and Andriy Mnih Department of Computer Science, University of Toronto 6 King’s College Rd, M5S 3G4, Canada {rsalakhu,amnih}@cs.toronto.edu Add to Reading List Source URL: www.cs.utoronto.ca Language: English - Date: 2008-01-11 20:55:37 Linear algebra Information retrieval Bayesian statistics Matrix theory Numerical linear algebra Singular value decomposition Netflix Prize Collaborative filtering Conjugate prior Statistics Algebra Mathematics
129	Refutation-Complete Binary Decision Diagrams Scott P. Sanner Department of Computer Science University of Toronto Toronto, ON M5S 3G4 Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2004-05-05 19:58:06 Boolean algebra Automated theorem proving Constraint programming Mathematical logic Diagrams Binary decision diagram DPLL algorithm Boolean satisfiability problem Resolution Theoretical computer science Mathematics Applied mathematics
130	Toronto Talk is Thirty Minutes in Duration, 2:00 to 2:30 on Tuesday, August 13, 2002 John P. Boyd∗ Department of Atmospheric, Oceanic and Space Science and Laboratory for Scientiﬁc Computation, University of Michigan Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2002-09-27 14:59:23 Trigonometry Fourier analysis Trigonometric functions Spherical harmonics Inverse trigonometric functions Polar coordinate system Chebyshev polynomials Mathematical analysis Mathematics Special functions

UPDATE